A Mixture of Delta-Rules Approximation to Bayesian Inference in Change-Point Problems

نویسندگان

  • Robert C. Wilson
  • Matthew R. Nassar
  • Joshua I. Gold
چکیده

Error-driven learning rules have received considerable attention because of their close relationships to both optimal theory and neurobiological mechanisms. However, basic forms of these rules are effective under only a restricted set of conditions in which the environment is stable. Recent studies have defined optimal solutions to learning problems in more general, potentially unstable, environments, but the relevance of these complex mathematical solutions to how the brain solves these problems remains unclear. Here, we show that one such Bayesian solution can be approximated by a computationally straightforward mixture of simple error-driven 'Delta' rules. This simpler model can make effective inferences in a dynamic environment and matches human performance on a predictive-inference task using a mixture of a small number of Delta rules. This model represents an important conceptual advance in our understanding of how the brain can use relatively simple computations to make nearly optimal inferences in a dynamic world.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Material : A mixture of Delta - rules approximation to Bayesian inference in change - point problems

Full derivation of approximate error vs number of nodes In order to compute the mean squared error we need expressions for four terms in equation 47 of the main text. These are the three terms related to the mean; i.e. m G 2 , µ i m G , and µ i µ j , and the average run-length distribution p i. We now derive these terms one at a time.

متن کامل

Bcp 2 : an Environment to Run Markov Chains for Bayesian Change Point Problems

1 Abstract We study a Bayesian nonparametric model for change point problems and propose a Markov chain method to approximate the posterior distributions of interest. The program developed to run the Gibbs sampler is called BCP 2 (Bayesian Change Point Problem). Its user-friendly graphical interface enables the user to enter the values of some parameters of interest and immediately obtain the c...

متن کامل

Bayesian Hierarchical Nonparametric Inference for Change-point Problems

SUMMARY Bayesian nonparametric inference for a nonsequential change-point problem is studied. We use a mixture of products of Dirichlet processes as our prior distribution. This allows the data before and after the change-point to be dependent, even when the change point is known. A Gibbs sampler algorithm is also proposed in order to overcome analytic diiculties in computing the posterior dist...

متن کامل

Dynamic Frailty and Change Point Models for Recurrent Events Data

Abstract. We present a Bayesian analysis for recurrent events data using a nonhomogeneous mixed Poisson point process with a dynamic subject-specific frailty function and a dynamic baseline intensity func- tion. The dynamic subject-specific frailty employs a dynamic piecewise constant function with a known pre-specified grid and the baseline in- tensity uses an unknown grid for the piecewise ...

متن کامل

A One-Stage Two-Machine Replacement Strategy Based on the Bayesian Inference Method

In this research, we consider an application of the Bayesian Inferences in machine replacement problem. The application is concerned with the time to replace two machines producing a specific product; each machine doing a special operation on the product when there are manufacturing defects because of failures. A common practice for this kind of problem is to fit a single distribution to the co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2013